Uniform Derivation of Decision Procedures by Superposition
نویسندگان
چکیده
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including lists, arrays, extensional arrays and combinations of them. We also give a superposition-based decision procedure for homomorphism.
منابع مشابه
Superposition and Decision Procedures Back and Forth
Two apparently different approaches to automating deduction are mentioned in the title; they are the subject of a debate on “big engines vs. little engines of proof”. The contributions in this thesis advocate that these two strands of research can interplay in subtle and sometimes unexpected ways, such that mutual pervasion can lead to intriguing results: Firstly, superposition can be run on to...
متن کاملParamodulation Decision Procedures
The aim of this thesis is to present Paramodulation Operators deciding the (i) Ackermann class with Equality [FS93] and (ii) the monadic class with equality [BGW93]. Ad (i) a refinement of the Ordered Paramodulation calculus [HR91] is used to define the appropriate inference operator; ad (ii) a variant of the Superposition calculus [BG94] is employed for this purpose. It seemed natural to give ...
متن کاملA Common Weight Multi-criteria Decision analysis-data Envelopment Analysis Approach with Assurance Region for Weight Derivation from Pairwise Comparison Matrices
Deriving weights from a pairwise comparison matrix (PCM) is a subject for which a wide range of methods have ever been presented. This paper proposes a common weight multi criteria decision analysis-data envelopment analysis (MCDA-DEA) approach with assurance region for weight derivation from a PCM. The proposed model has several merits over the competing approaches and removes the drawbacks of...
متن کاملSaturation-based decision procedures for fixed domain and minimal model validity
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal Herbrand model for the theory. This raises the question in how far superposition calculi can be employed for reasoning about such minimal models. This is indeed often possible when existentia...
متن کاملA rule-based system for automatic decidability and combinability
This paper deals with decision procedures specified by using a superposition calculus which is an inference system at the core of all equational theorem provers. This calculus is refutation complete: it provides a semi-decision procedure that halts on unsatisfiable inputs but may diverge on satisfiable ones. Fortunately, it may also terminate for some theories of interest in verification, and t...
متن کامل